The structure of 3-connected matroids of path width three
نویسندگان
چکیده
A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . , ek}, {ek+1, ek+2, . . . , en}) is a 3-separation for all k in {3, 4, . . . , n − 3}. In this paper, we consider the possible sequential orderings that such a matroid can have. In particular, we prove that M essentially has two fixed ends, each of which is a maximal segment, a maximal cosegment, or a maximal fan. We also identify the possible structures in M that account for different sequential orderings of E(M). These results rely on an earlier paper of the authors that describes the structure of equivalent non-sequential 3-separations in a 3-connected matroid. Those results are extended here to describe the structure of equivalent sequential 3-separations.
منابع مشابه
Fork-decompositions of Matroids
One of the central problems in matroid theory is Rota’s conjecture that, for all prime powers q, the class of GF (q)–representable matroids has a finite set of excluded minors. This conjecture has been settled for q ≤ 4 but remains open otherwise. Further progress towards this conjecture has been hindered by the fact that, for all q > 5, there are 3–connected GF (q)–representable matroids havin...
متن کاملFork-decompositions of ?\iatroids
One of the central problems in matroid theory is Rota's conjecture that, for all prime powers q, the class of GF(q)-representable matroids has a finite set of excluded minors. This conjecture has been settled for q s; 4 but remains open otherwise. Further progress towards this conjecture has been hindered by the fact that, for all q > 5, there are 3-connected GF(q)-representable matroids having...
متن کاملConstructive characterizations of 3-connected matroids of path width three
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . , ek}, {ek+1, ek+2, . . . , en}) is a 3-separation for all k in {3, 4, . . . , n − 3}. This paper proves that every sequential matroid is easily constructible from a uniform matroid of rank or corank two by a sequence...
متن کاملSimpler Self-reduction Algorithm for Matroid Path-width
Path-width of matroids naturally generalizes better known path-width of graphs, and is NP-hard by a reduction from the graph case. While the term matroid path-width was formally introduced by Geelen–Gerards–Whittle [JCTB 2006] in pure matroid theory, it was soon recognized by Kashyap [SIDMA 2008] that it is the same concept as long-studied so called trellis complexity in coding theory, later na...
متن کاملar X iv : m at h / 04 03 33 7 v 1 [ m at h . C O ] 2 1 M ar 2 00 4 LATTICE PATH MATROIDS : STRUCTURAL PROPERTIES
This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One of the main results is a characterization of lattice path matroids in terms of fundamental flats, which are special connected flats from which one can recove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 28 شماره
صفحات -
تاریخ انتشار 2007